Constructive Versions of Ordinal Number Classes
نویسندگان
چکیده
منابع مشابه
Constructive Versions of Ordinal Number Classes
0. Introduction and summary. Almost from its beginning, the theory of ordinal numbers has included results which can, in a rather concrete sense, be viewed as theorems about notations for ordinal numbers. For example the theorems on polynomial normal forms for those ordinals that lie below the least e number can be understood as providing a certain unique notation of finite length for each such...
متن کاملConstructive Versions of Tarskγs Fixed Point Theorems
Let F be a monotone operator on the complete lattice L into itself. Tarski's lattice theoretical fixed point theorem states that the set of fixed points of F is a nonempty complete lattice for the ordering of L. We give a constructive proof of this theorem showing that the set of fixed points of F is the image of L by a lower and an upper preclosure operator. These preclosure operators are the ...
متن کاملPredicting Ordinal Classes in ILP
This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes in an ILP setting. We start with a relational regression algorithm named SRT (Structural Regression Trees) and study various ways of transforming it into a rst-order learner for ordinal classiication tasks. Combinations of these algorithm variants with several data preprocessing methods are comp...
متن کاملConstructive Type Classes in Isabelle
We reconsider the well-known concept of Haskell-style type classes within the logical framework of Isabelle. So far, axiomatic type classes in Isabelle merely account for the logical aspect as predicates over types, while the operational part is only a convention based on raw overloading. Our more elaborate approach to constructive type classes provides a seamless integration with Isabelle loca...
متن کاملPrediction of Ordinal Classes Using Regression Trees
This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes using classification and regression trees. We start with S-CART, a tree induction algorithm, and study various ways of transforming it into a learner for ordinal classification tasks. These algorithm variants are compared on a number of benchmark data sets to verify the relative strengths and we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1961
ISSN: 0002-9947
DOI: 10.2307/1993323